An Improved Randomized Approximation Algorithm for Max TSP
نویسندگان
چکیده
We present an O(n)-time randomized approximation algorithm for the maximum traveling salesman problem whose expected approximation ratio is asymptotically 251 331 , where n is the number of vertices in the input (undirected) graph. This improves the previous best.
منابع مشابه
A On Approximating Multi-Criteria TSP
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 − ε. For multi-criteria Max-AT...
متن کاملDeterministic algorithms for multi-criteria Max-TSP
We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of 1/2k−ε and 1/(4k−2)−ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملA 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
The traveling salesman problem is one of the most famous and heavily researched problems in computer science. The version we deal with in this paper is the Symmetric Maximum Traveling Salesman Problem, which is defined as follows. For a given complete undirected graph G with nonnegative weights on its edges, we wish to find a tour of the graph of maximum weight. The tour of the graph is a simpl...
متن کاملMulti-Criteria TSP: Min and Max Combined
We present randomized approximation algorithms for multicriteria traveling salesman problems (TSP), where some objective functions should be minimized while others should be maximized. For the symmetric multi-criteria TSP (STSP), we present an algorithm that computes (2/3−ε, 4+ε) approximate Pareto curves. Here, the first parameter is the approximation ratio for the objectives that should be ma...
متن کاملImproved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman
We improve and derandomize the best known approximation algorithm for the twocriteria metric traveling salesman problem (2-TSP). More precisely, we construct a deterministic 2-approximation which answers an open question by Manthey. Moreover, we show that 2-TSP is randomized (3/2 + ε, 2)-approximable, and we give the first randomized approximations for the two-criteria traveling salesman path p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 9 شماره
صفحات -
تاریخ انتشار 2005